Applying GSAT to Non-Clausal Formulas
نویسنده
چکیده
In this paper we describe how to modify GSAT so that it can be applied to non-clausal formulas. The idea is to use a particular \score" function which gives the number of clauses of the CNF conversion of a formula which are false under a given truth assignment. Its value is computed in linear time, without constructing the CNF conversion itself. The proposed methodology applies to most of the variants of GSAT proposed so far.
منابع مشابه
GSAT with Adaptive Score Function
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract GSAT is a well-known satisfiability search algorithm. In this paper we consider a modification of GSAT. In particular, we consider an adaptive score function. Investigation of efficient satisfiability algorithms and encoding d...
متن کاملSatisfiability Checking of Non-clausal Formulas Using General Matings
Most state-of-the-art SAT solvers are based on DPLL search and require the input formula to be in clausal form (cnf). However, typical formulas that arise in practice are non-clausal. We present a new non-clausal SAT-solver based on General Matings instead of DPLL search. Our technique is able to handle non-clausal formulas involving ∧,∨,¬ operators without destroying their structure or introdu...
متن کاملTR - 2003 - 09 The HORN - NNF - SAT problem is linear
Many applications in Computer Science require to represent knowledge and reason with non-clausal form formulas. However, most of the advances obtained in tractable reasoning are applied only to CNF formulas. In this paper, we extend tractability (even linearity) to certain non-clausal formulas which are of high practical interest. For instance, the real applications of the Knowledge Rule-based ...
متن کاملPartial instantiation theorem proving for distributed resource location
In this paper, we present a partial instantiation theorem prover (INSTANT) which handles sentences in first-order logic in clausal or non-clausal form. INSTANT uses a variant of the GSAT algorithm for determining the satisfiability of a propositional sentence to increase its speed. The algorithm used in INSTANT can be parallelized with good speedup to improve performance. INSTANT is designed fo...
متن کاملGeneration of Hard Non-Clausal Random Satisfiability Problems
We present the results from experiments with a new family of random formulas for the satisfiability problem. Our proposal is a generalisation of the random k-SAT model that introduces non-clausal formulas and exhibits interesting features such as experimentally observed sharp phase transition and the easy-hard-easy pattern. The experimental results provide some insights on how the use of differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/9406102 شماره
صفحات -
تاریخ انتشار 1994